منابع مشابه
Exploiting Unique Fixed Points
Functional programmers happily use equational reasoning and induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, per perhaps less enthusiastically. Coinduction is often considered as a rather low-level proof method, especially, as it seems to depart rather radically from equational reasoning. In this talk we introduce an altern...
متن کاملEquational properties of stratified least fixed points
Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove that this new operation satisfies ‘the standard’ identities of fixed point operations as described by the axioms of iteration theories. We also study this new f...
متن کاملLeast and Greatest Fixed Points in Ludics
Various logics have been introduced in order to reason over (co)inductive specifications and, through the Curry-Howard correspondence, to study computation over inductive and coinductive data. The logic μMALL is one of those logics, extending multiplicative and additive linear logic with least and greatest fixed point operators. In this paper, we investigate the semantics of μMALL proofs in (co...
متن کاملUnique Fixed Points in Domain Theory
We unveil new results based on measurement that guarantee the existence of unique xed points which need not be maximal. In addition, we establish that least xed points are always attractors in the topology, and then explore the consequences of these ndings in analysis. In particular, an extension of the Banach xed point theorem on compact metric spaces 3] is obtained.
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1980
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90056-0